Field-based Fuzzy Spatial Reasoning Model for Geographical Information Systems: Case of Constraint Satisfaction Problem
نویسندگان
چکیده
Humans’ representation in nature language about geographic phenomena is usually qualitative rather than quantitative. Qualitative spatial reasoning provides an approach which is considered to be closer to the representation. Commercial GIS software are confronted with a challenge that the software should be equipped with artificial intelligent functions like qualitative spatial reasoning for more and more users, especially for spatial decision-makers. This paper proposes a framework of field-based fuzzy spatial reasoning through which qualitative description usually encountered in spatial reasoning process can be handled quantitatively. As preconditioning, field-based fuzzy representation structure for qualitative description is put forward, then the methods of constructing membership function are discussed. Standard operations of field-based fuzzy spatial reasoning model in the case of constraint satisfaction problem (CSP) are illustrated. An example explains the implication of the model in spatial decision-making process.
منابع مشابه
Developing a Model Based on Geospatial Information Systems (GIS) and Adaptive Neuro-Fuzzy Inference Systems (ANFIS) for Providing the Spatial Distribution Map of Landslide Risk. Case Study: Alborz Province
Landslide is one of these natural hazards which causes a great amount of financial and human damage annually allover the world. Accordingly, identification of areas with landslide threat for implementation of preventive measures in order to confront against the instability of hillsides for reduction of potential threats and related risks is very important. In this research a new method for clas...
متن کاملFormal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of these calculi is that reasoning in them can be understood as solving a binary constraint satisfaction problem over infinite domains. The main algorithmic method that is used is constraint propagation ...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملModel-Based Image Interpretation under Uncertainty and Fuzziness
Structural models such as ontologies and graphs can encode generic knowledge about a scene observed in an image. Their use in spatial reasoning schemes allows driving segmentation and recognition of objects and structures in images. The developed methods include finding a best segmentation path in a graph, global solving of a constraint satisfaction problem, integrating prior knowledge in defor...
متن کاملA Comprehensive Mathematical Model for Designing an Organ Transplant Supply Chain Network under Uncertainty
One of the most important issues in area of health and hygiene is location-allocation of organ harvesting centers and transplant centers according to coordination between supply and demand. In this paper, a mathematical model is presented for location-allocation of organ harvesting centers and transplant centers. The proposed model does not only minimize the present value of the total system co...
متن کامل